A New Extragradient-Type Algorithm for the Split Feasibility Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولStrong convergence of an extragradient-type algorithm for the multiple-sets split equality problem
This paper introduces a new extragradient-type method to solve the multiple-sets split equality problem (MSSEP). Under some suitable conditions, the strong convergence of an algorithm can be verified in the infinite-dimensional Hilbert spaces. Moreover, several numerical results are given to show the effectiveness of our algorithm.
متن کاملA Modified Algorithm for Solving the Split Feasibility Problem
In this paper a modified algorithm for solving the split feasibility problem (SFP) is presented. This algorithm uses the generalized Armijo line search in computing predictor step size and gives a correction step rule in the iterative process, which makes an accelerated convergence to the solution of SFP. Meanwhile, it needs not to compute the matrix inverses and the large eigenvalue of the mat...
متن کاملRelaxed Implicit Extragradient-like Methods for Finding Minimum-norm Solutions of the Split Feasibility Problem
In this paper, we consider the split feasibility problem (SFP) in infinite-dimensional Hilbert spaces, and study the relaxed implicit extragradient-like methods for finding a common element of the solution set Γ of the SFP and the set Fix(S) of fixed points of a nonexpansive mapping S. Combining Mann’s implicit iterative method and Korpelevich’s extragradient method, we propose two implicit ite...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2016
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2016/6851393